- off-line algorithm
- свободный алгоритм (алгоритм, работающий в свободном режиме)
Англо-русский словарь промышленной и научной лексики. 2014.
off-line algorithm
Смотреть что такое "off-line algorithm" в других словарях:
Tarjan's off-line least common ancestors algorithm — In computer science, Tarjan s off line least common ancestors algorithm is an algorithm for computing lowest common ancestors for pairs of nodes in a tree, based on the union find data structure. The least common ancestor of two nodes d and e in… … Wikipedia
line — Synonyms and related words: DMZ, Indian file, L, MO, Spenserian stanza, WATS, WATS line, Zeitgeist, abut, accommodation, accompaniment, accord, accordance, aceldama, acknowledgment, acquiescence, acquire, action, activity, adaptation, adaption,… … Moby Thesaurus
Kahan summation algorithm — In numerical analysis, the Kahan summation algorithm (also known as compensated summation) significantly reduces the numerical error in the total obtained by adding a sequence of finite precision floating point numbers, compared to the obvious… … Wikipedia
Aho-Corasick algorithm — The Aho Corasick algorithm is a string searching algorithm created by Alfred V. Aho and Margaret J. Corasick. It is a kind of dictionary matching algorithm that locates elements of a finite set of strings (the dictionary ) within an input text.… … Wikipedia
Aho–Corasick string matching algorithm — The Aho–Corasick string matching algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick. It is a kind of dictionary matching algorithm that locates elements of a finite set of strings (the dictionary ) within … Wikipedia
Gauss–Newton algorithm — The Gauss–Newton algorithm is a method used to solve non linear least squares problems. It can be seen as a modification of Newton s method for finding a minimum of a function. Unlike Newton s method, the Gauss–Newton algorithm can only be used… … Wikipedia
Maze solving algorithm — There are a number of different maze solving algorithms, that is, automated methods for the solving of mazes. A few important maze solving algorithms are explained below. The random mouse, wall follower, Pledge, and Trémaux algorithms are… … Wikipedia
OPTICS algorithm — OPTICS ( Ordering Points To Identify the Clustering Structure ) is an algorithm for finding density based clusters in spatial data. It was presented by Mihael Ankerst, Markus M. Breunig, Hans Peter Kriegel and Jörg Sander[1]. Its basic idea is… … Wikipedia
Levenberg–Marquardt algorithm — In mathematics and computing, the Levenberg–Marquardt algorithm (LMA)[1] provides a numerical solution to the problem of minimizing a function, generally nonlinear, over a space of parameters of the function. These minimization problems arise… … Wikipedia
Ziggurat algorithm — The ziggurat algorithm is an algorithm to generate random numbers from a non uniform distribution. It belongs to the class of rejection sampling algorithms and can be used for choosing values from a monotone decreasing probability distribution.… … Wikipedia
Liu Hui's π algorithm — is a mathematical algorithm invented by Liu Hui (fl. 3rd century), a mathematician of Wei Kingdom. Before his time, the ratio of the circumference of a circle to diameter was often taken experimentally as 3 in China, while Zhang Heng (78… … Wikipedia
